Independence Promoted Graph Disentangled Networks
نویسندگان
چکیده
منابع مشابه
Tag Disentangled Generative Adversarial Networks for Object Image Re-rendering
In this paper, we propose a principled Tag Disentangled Generative Adversarial Networks (TDGAN) for re-rendering new images for the object of interest from a single image of it by specifying multiple scene properties (such as viewpoint, illumination, expression, etc.). The whole framework consists of a disentangling network, a generative network, a tag mapping net, and a discriminative network,...
متن کاملDisentangled Person Image Generation
Generating novel, yet realistic, images of persons is a challenging task due to the complex interplay between the different image factors, such as the foreground, background and pose information. In this work, we aim at generating such images based on a novel, two-stage reconstruction pipeline that learns a disentangled representation of the aforementioned image factors and generates novel pers...
متن کاملParallel Independence in Hierarchical Graph Transformation
Hierarchical graph transformation as defined in [1, 2] extends double-pushout graph transformation in the spirit of term rewriting: Graphs are provided with hierarchical structure, and transformation rules are equipped with graph variables. In this paper we analyze conditions under which diverging transformation steps H ⇐ G ⇒ H ′ can be joined by subsequent transformation sequences H ∗ ⇒ M ∗ ⇐ ...
متن کاملGraph products with log-concave independence polynomials
A stable set in a graph G is a set of pairwise non-adjacent vertices. The independence polynomial of G is I(G;x) = s0+s1x+s2x 2 +...+sαx α , where α = α(G) is the cardinality of a maximum stable of G, while sk equals the number of stable sets of size k in G (Gutman and Harary, 1983). Hamidoune, 1990, showed that for every claw-free graph G (i.e., a graph having no induced subgraph isomorphic to...
متن کاملInverse Independence Number of a Graph
The concept of inverse domination was introduced by Kulli V.R. and Sigarakanti S.C. [9] . Let D be a set of G. A dominating set D1 VD is called an inverse dominating set of G with respect to D. The inverse domination number (G) is the order of a smallest inverse dominating set. Motivated by this definition we define another parameter as follows. Let D be a maximum independent set in G. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i04.5929